Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs
نویسندگان
چکیده
We present an implementation of a linear-time approximation scheme for the traveling salesman problem on planar graphs with edge weights. We observe that the theoretical algorithm involves constants that are too large for practical use. Our implementation, which is not subject to the theoretical algorithm’s guarantee, can quickly find good tours in very large planar graphs. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
A linear-time approximation scheme for TSP in planar graphs with edge-weights
We give an algorithm requiring O(c 2 n) time to find an -optimal traveling salesman tour in the metric defined by a planar graph with nonnegative edge-lengths.
متن کاملA Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
We give an algorithm requiring O(c1/ǫ 2 n) time to find an ǫ-optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgelengths. For the case of all lengths equal to 1, the time required is O(c1/ǫn).
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملAsymmetric Traveling Salesman Problem on Graphs with Bounded Genus
The symmetric traveling salesman problem (STSP) is a special case of ATSP in which the cost function is symmetric (i.e. c(u, v) = c(v, u)). Christofides in 1976 [6] discovered a 3/2approximation algorithm for STSP. No better approximation algorithm has since been found for the general symmetric metric case. However, polynomial-time approximation schemes have been found when the distances are sh...
متن کاملAn Approximation Scheme for Planar Graph TSP
We consider the special case of the traveling salesman problem (TSP) in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial-time approximation scheme (PTAS) for this problem.
متن کامل